Geometry of ν-Tamari lattices in types A and B
نویسندگان
چکیده
In this extended abstract, we exploit the combinatorics and geometry of triangulations of products of simplices to reinterpret and generalize a number of constructions in Catalan combinatorics. In our framework, the main role of “Catalan objects” is played by (I, J)-trees: bipartite trees associated to a pair (I, J) of finite index sets that stand in simple bijection with lattice paths weakly above a lattice path ν = ν(I, J). Such trees label the maximal simplices of a triangulation of a subpolytope of the cartesian product of two simplices, which provides a geometric realization of the ν-Tamari lattice introduced by Préville-Ratelle and Viennot. Dualizing this triangulation, we obtain a polyhedral complex induced by an arrangement of tropical hyperplanes whose 1-skeleton realizes the Hasse diagram of the ν-Tamari lattice, and thus generalizes the simple associahedron. Specializing to the Fuss-Catalan case realizes the m-Tamari lattices as 1-skeleta of regular subdivisions of classical associahedra, giving a positive answer to a question of F. Bergeron. The simplicial complex underlying our triangulation has its h-vector given by a suitable generalization of the Narayana numbers. We propose it as a natural generalization of the classical simplicial associahedron, alternative to the rational associahedron of Armstrong, Rhoades and Williams. Our methods are amenable to cyclic symmetry, which we use to present type-B analogues of our constructions. Notably, we define a partial order that generalizes the type B Tamari lattice, introduced independently by Thomas and Reading, along with corresponding geometric realizations.
منابع مشابه
Tamari Lattices and the symmetric Thompson monoid
We investigate the connection between Tamari lattices and the Thompson group F , summarized in the fact that F is a group of fractions for a certain monoid F sym whose Cayley graph includes all Tamari lattices. Under this correspondence, the Tamari lattice operations are the counterparts of the least common multiple and greatest common divisor operations in F sym. As an application, we show tha...
متن کاملCambrian Lattices
For an arbitrary finite Coxeter group W , we define the family of Cambrian lattices for W as quotients of the weak order on W with respect to certain lattice congruences. We associate to each Cambrian lattice a complete fan, which we conjecture is the normal fan of a polytope combinatorially isomorphic to the generalized associahedron for W . In types A and B, we obtain, by means of a fiber-pol...
متن کاملAn Analogue of Distributivity for Ungraded Lattices
In this paper, we define a property, trimness, for lattices. Trimness is a not-necessarily-graded generalization of distributivity; in particular, if a lattice is trim and graded, it is distributive. Trimness is preserved under taking intervals and suitable sublattices. Trim lattices satisfy a weakened form of modularity. The order complex of a trim lattice is contractible or homotopic to a sph...
متن کاملChains of Maximum Length in the Tamari Lattice
The Tamari lattice Tn was originally defined on bracketings of a set of n+1 objects, with a cover relation based on the associativity rule in one direction. Although in several related lattices, the number of maximal chains is known, quoting Knuth, “The enumeration of such paths in Tamari lattices remains mysterious.” The lengths of maximal chains vary over a great range. In this paper, we focu...
متن کاملDistributive lattices with strong endomorphism kernel property as direct sums
Unbounded distributive lattices which have strong endomorphism kernel property (SEKP) introduced by Blyth and Silva in [3] were fully characterized in [11] using Priestley duality (see Theorem 2.8}). We shall determine the structure of special elements (which are introduced after Theorem 2.8 under the name strong elements) and show that these lattices can be considered as a direct product of ...
متن کامل